TSTP Solution File: SEV261^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV261^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:41:56 EDT 2024
% Result : Theorem 0.21s 0.43s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 74
% Syntax : Number of formulae : 205 ( 1 unt; 45 typ; 0 def)
% Number of atoms : 1249 ( 408 equ; 0 cnn)
% Maximal formula atoms : 19 ( 7 avg)
% Number of connectives : 1121 ( 370 ~; 309 |; 166 &; 205 @)
% ( 21 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 165 ( 165 >; 0 *; 0 +; 0 <<)
% Number of symbols : 71 ( 67 usr; 59 con; 0-2 aty)
% ( 0 !!; 21 ??; 0 @@+; 0 @@-)
% Number of variables : 452 ( 341 ^ 67 !; 43 ?; 452 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_13,type,
sK3: a > $o ).
thf(func_def_14,type,
sK4: a > $o ).
thf(func_def_15,type,
sK5: ( a > $o ) > $o ).
thf(func_def_16,type,
sK6: a > $o ).
thf(func_def_17,type,
sK7: a > $o ).
thf(func_def_18,type,
sK8: a > $o ).
thf(func_def_19,type,
sK9: a > $o ).
thf(func_def_21,type,
ph11:
!>[X0: $tType] : X0 ).
thf(func_def_22,type,
sK12: a ).
thf(func_def_23,type,
sK13: a ).
thf(func_def_24,type,
sK14: a > a > $o ).
thf(func_def_25,type,
sK15: a ).
thf(func_def_26,type,
sK16: a > $o ).
thf(func_def_27,type,
sK17: a ).
thf(func_def_28,type,
sK18: a ).
thf(func_def_45,type,
sK19: a ).
thf(func_def_46,type,
sK20: a ).
thf(func_def_47,type,
sK21: a ).
thf(func_def_48,type,
sK22: a ).
thf(func_def_49,type,
sK23: a ).
thf(func_def_50,type,
sK24: a ).
thf(func_def_51,type,
sK25: a ).
thf(func_def_52,type,
sK26: a ).
thf(func_def_53,type,
sK27: a ).
thf(func_def_54,type,
sK28: a ).
thf(func_def_55,type,
sK29: a ).
thf(func_def_56,type,
sK30: a ).
thf(func_def_57,type,
sK31: a ).
thf(func_def_58,type,
sK32: a ).
thf(func_def_59,type,
sK33: a ).
thf(func_def_60,type,
sK34: a ).
thf(func_def_61,type,
sK35: a > a ).
thf(func_def_62,type,
sK36: a ).
thf(func_def_63,type,
sK37: a ).
thf(func_def_64,type,
sK38: a ).
thf(func_def_65,type,
sK39: a ).
thf(func_def_66,type,
sK40: a ).
thf(func_def_67,type,
sK41: a ).
thf(func_def_68,type,
sK42: a ).
thf(func_def_69,type,
sK43: a ).
thf(func_def_70,type,
sK44: a ).
thf(func_def_71,type,
sK45: a ).
thf(func_def_72,type,
sK46: a ).
thf(f1433,plain,
$false,
inference(avatar_sat_refutation,[],[f58,f76,f81,f86,f91,f100,f101,f106,f112,f117,f122,f126,f135,f173,f236,f261,f451,f987,f993,f1000,f1208,f1430]) ).
thf(f1430,plain,
( spl10_1
| ~ spl10_9
| ~ spl10_17 ),
inference(avatar_contradiction_clause,[],[f1429]) ).
thf(f1429,plain,
( $false
| spl10_1
| ~ spl10_9
| ~ spl10_17 ),
inference(trivial_inequality_removal,[],[f1426]) ).
thf(f1426,plain,
( ( $true = $false )
| spl10_1
| ~ spl10_9
| ~ spl10_17 ),
inference(superposition,[],[f823,f1390]) ).
thf(f1390,plain,
( ! [X1: a] :
( ( sK6 @ X1 )
= $false )
| ~ spl10_17 ),
inference(beta_eta_normalization,[],[f1355]) ).
thf(f1355,plain,
( ! [X1: a] :
( ( sK6 @ X1 )
= ( ^ [Y0: a] : $false
@ X1 ) )
| ~ spl10_17 ),
inference(argument_congruence,[],[f130]) ).
thf(f130,plain,
( ( sK6
= ( ^ [Y0: a] : $false ) )
| ~ spl10_17 ),
inference(avatar_component_clause,[],[f128]) ).
thf(f128,plain,
( spl10_17
<=> ( sK6
= ( ^ [Y0: a] : $false ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_17])]) ).
thf(f823,plain,
( ( $true
= ( sK6 @ sK33 ) )
| spl10_1
| ~ spl10_9 ),
inference(binary_proxy_clausification,[],[f821]) ).
thf(f821,plain,
( ( ( ( sK6 @ sK33 )
& ( sK7 @ sK33 ) )
!= $false )
| spl10_1
| ~ spl10_9 ),
inference(beta_eta_normalization,[],[f811]) ).
thf(f811,plain,
( ( ( ^ [Y0: a] : $false
@ sK33 )
!= ( ^ [Y0: a] :
( ( sK6 @ Y0 )
& ( sK7 @ Y0 ) )
@ sK33 ) )
| spl10_1
| ~ spl10_9 ),
inference(negative_extensionality,[],[f733]) ).
thf(f733,plain,
( ( ( ^ [Y0: a] :
( ( sK6 @ Y0 )
& ( sK7 @ Y0 ) ) )
!= ( ^ [Y0: a] : $false ) )
| spl10_1
| ~ spl10_9 ),
inference(trivial_inequality_removal,[],[f719]) ).
thf(f719,plain,
( ( ( ^ [Y0: a] :
( ( sK6 @ Y0 )
& ( sK7 @ Y0 ) ) )
!= ( ^ [Y0: a] : $false ) )
| ( sK8 != sK8 )
| spl10_1
| ~ spl10_9 ),
inference(constrained_superposition,[],[f53,f90]) ).
thf(f90,plain,
( ( ( ^ [Y0: a] :
( ( sK6 @ Y0 )
& ( sK7 @ Y0 ) ) )
= sK8 )
| ~ spl10_9 ),
inference(avatar_component_clause,[],[f88]) ).
thf(f88,plain,
( spl10_9
<=> ( ( ^ [Y0: a] :
( ( sK6 @ Y0 )
& ( sK7 @ Y0 ) ) )
= sK8 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_9])]) ).
thf(f53,plain,
( ( sK8
!= ( ^ [Y0: a] : $false ) )
| spl10_1 ),
inference(avatar_component_clause,[],[f51]) ).
thf(f51,plain,
( spl10_1
<=> ( sK8
= ( ^ [Y0: a] : $false ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
thf(f1208,plain,
( spl10_1
| ~ spl10_9
| ~ spl10_11 ),
inference(avatar_contradiction_clause,[],[f1207]) ).
thf(f1207,plain,
( $false
| spl10_1
| ~ spl10_9
| ~ spl10_11 ),
inference(trivial_inequality_removal,[],[f1201]) ).
thf(f1201,plain,
( ( $true = $false )
| spl10_1
| ~ spl10_9
| ~ spl10_11 ),
inference(superposition,[],[f1197,f822]) ).
thf(f822,plain,
( ( ( sK7 @ sK33 )
= $true )
| spl10_1
| ~ spl10_9 ),
inference(binary_proxy_clausification,[],[f821]) ).
thf(f1197,plain,
( ! [X1: a] :
( $false
= ( sK7 @ X1 ) )
| ~ spl10_11 ),
inference(beta_eta_normalization,[],[f1162]) ).
thf(f1162,plain,
( ! [X1: a] :
( ( ^ [Y0: a] : $false
@ X1 )
= ( sK7 @ X1 ) )
| ~ spl10_11 ),
inference(argument_congruence,[],[f99]) ).
thf(f99,plain,
( ( sK7
= ( ^ [Y0: a] : $false ) )
| ~ spl10_11 ),
inference(avatar_component_clause,[],[f97]) ).
thf(f97,plain,
( spl10_11
<=> ( sK7
= ( ^ [Y0: a] : $false ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_11])]) ).
thf(f1000,plain,
( ~ spl10_10
| ~ spl10_57 ),
inference(avatar_contradiction_clause,[],[f999]) ).
thf(f999,plain,
( $false
| ~ spl10_10
| ~ spl10_57 ),
inference(trivial_inequality_removal,[],[f995]) ).
thf(f995,plain,
( ( $true = $false )
| ~ spl10_10
| ~ spl10_57 ),
inference(superposition,[],[f986,f304]) ).
thf(f304,plain,
( ! [X1: a] :
( $true
= ( sK7 @ X1 ) )
| ~ spl10_10 ),
inference(beta_eta_normalization,[],[f295]) ).
thf(f295,plain,
( ! [X1: a] :
( ( ^ [Y0: a] : $true
@ X1 )
= ( sK7 @ X1 ) )
| ~ spl10_10 ),
inference(argument_congruence,[],[f95]) ).
thf(f95,plain,
( ( sK7
= ( ^ [Y0: a] : $true ) )
| ~ spl10_10 ),
inference(avatar_component_clause,[],[f93]) ).
thf(f93,plain,
( spl10_10
<=> ( sK7
= ( ^ [Y0: a] : $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_10])]) ).
thf(f986,plain,
( ( $false
= ( sK7 @ sK36 ) )
| ~ spl10_57 ),
inference(avatar_component_clause,[],[f984]) ).
thf(f984,plain,
( spl10_57
<=> ( $false
= ( sK7 @ sK36 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_57])]) ).
thf(f993,plain,
( ~ spl10_18
| ~ spl10_56 ),
inference(avatar_contradiction_clause,[],[f992]) ).
thf(f992,plain,
( $false
| ~ spl10_18
| ~ spl10_56 ),
inference(trivial_inequality_removal,[],[f989]) ).
thf(f989,plain,
( ( $true = $false )
| ~ spl10_18
| ~ spl10_56 ),
inference(superposition,[],[f634,f982]) ).
thf(f982,plain,
( ( $false
= ( sK6 @ sK36 ) )
| ~ spl10_56 ),
inference(avatar_component_clause,[],[f980]) ).
thf(f980,plain,
( spl10_56
<=> ( $false
= ( sK6 @ sK36 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_56])]) ).
thf(f634,plain,
( ! [X1: a] :
( ( sK6 @ X1 )
= $true )
| ~ spl10_18 ),
inference(beta_eta_normalization,[],[f610]) ).
thf(f610,plain,
( ! [X1: a] :
( ( sK6 @ X1 )
= ( ^ [Y0: a] : $true
@ X1 ) )
| ~ spl10_18 ),
inference(argument_congruence,[],[f134]) ).
thf(f134,plain,
( ( sK6
= ( ^ [Y0: a] : $true ) )
| ~ spl10_18 ),
inference(avatar_component_clause,[],[f132]) ).
thf(f132,plain,
( spl10_18
<=> ( sK6
= ( ^ [Y0: a] : $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_18])]) ).
thf(f987,plain,
( spl10_56
| spl10_57
| ~ spl10_9
| ~ spl10_10
| spl10_36 ),
inference(avatar_split_clause,[],[f978,f328,f93,f88,f984,f980]) ).
thf(f328,plain,
( spl10_36
<=> ( sK7 = sK8 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_36])]) ).
thf(f978,plain,
( ( $false
= ( sK7 @ sK36 ) )
| ( $false
= ( sK6 @ sK36 ) )
| ~ spl10_9
| ~ spl10_10
| spl10_36 ),
inference(binary_proxy_clausification,[],[f977]) ).
thf(f977,plain,
( ( $true
!= ( ( sK6 @ sK36 )
& ( sK7 @ sK36 ) ) )
| ~ spl10_9
| ~ spl10_10
| spl10_36 ),
inference(beta_eta_normalization,[],[f964]) ).
thf(f964,plain,
( ( ( ^ [Y0: a] : $true
@ sK36 )
!= ( ^ [Y0: a] :
( ( sK6 @ Y0 )
& ( sK7 @ Y0 ) )
@ sK36 ) )
| ~ spl10_9
| ~ spl10_10
| spl10_36 ),
inference(negative_extensionality,[],[f742]) ).
thf(f742,plain,
( ( ( ^ [Y0: a] :
( ( sK6 @ Y0 )
& ( sK7 @ Y0 ) ) )
!= ( ^ [Y0: a] : $true ) )
| ~ spl10_9
| ~ spl10_10
| spl10_36 ),
inference(subsumption_resolution,[],[f721,f330]) ).
thf(f330,plain,
( ( sK7 != sK8 )
| spl10_36 ),
inference(avatar_component_clause,[],[f328]) ).
thf(f721,plain,
( ( ( ^ [Y0: a] :
( ( sK6 @ Y0 )
& ( sK7 @ Y0 ) ) )
!= ( ^ [Y0: a] : $true ) )
| ( sK7 = sK8 )
| ~ spl10_9
| ~ spl10_10 ),
inference(constrained_superposition,[],[f95,f90]) ).
thf(f451,plain,
( ~ spl10_36
| ~ spl10_10
| spl10_15 ),
inference(avatar_split_clause,[],[f444,f119,f93,f328]) ).
thf(f119,plain,
( spl10_15
<=> ( ( ^ [Y0: a] : $true )
= sK8 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_15])]) ).
thf(f444,plain,
( ( sK7 != sK8 )
| ~ spl10_10
| spl10_15 ),
inference(superposition,[],[f121,f95]) ).
thf(f121,plain,
( ( ( ^ [Y0: a] : $true )
!= sK8 )
| spl10_15 ),
inference(avatar_component_clause,[],[f119]) ).
thf(f261,plain,
( ~ spl10_5
| spl10_14
| ~ spl10_19 ),
inference(avatar_contradiction_clause,[],[f260]) ).
thf(f260,plain,
( $false
| ~ spl10_5
| spl10_14
| ~ spl10_19 ),
inference(trivial_inequality_removal,[],[f257]) ).
thf(f257,plain,
( ( $true = $false )
| ~ spl10_5
| spl10_14
| ~ spl10_19 ),
inference(superposition,[],[f161,f245]) ).
thf(f245,plain,
( ! [X1: a] :
( $false
= ( sK16 @ X1 ) )
| ~ spl10_19 ),
inference(beta_eta_normalization,[],[f237]) ).
thf(f237,plain,
( ! [X1: a] :
( ( ^ [Y0: a] : $false
@ X1 )
= ( sK16 @ X1 ) )
| ~ spl10_19 ),
inference(argument_congruence,[],[f168]) ).
thf(f168,plain,
( ( sK16
= ( ^ [Y0: a] : $false ) )
| ~ spl10_19 ),
inference(avatar_component_clause,[],[f166]) ).
thf(f166,plain,
( spl10_19
<=> ( sK16
= ( ^ [Y0: a] : $false ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_19])]) ).
thf(f161,plain,
( ( ( sK16 @ sK15 )
= $true )
| ~ spl10_5
| spl10_14 ),
inference(binary_proxy_clausification,[],[f159]) ).
thf(f159,plain,
( ( ( ( sK16 @ sK15 )
& ( sK5 @ sK16 ) )
= $true )
| ~ spl10_5
| spl10_14 ),
inference(beta_eta_normalization,[],[f158]) ).
thf(f158,plain,
( ( $true
= ( ^ [Y0: a > $o] :
( ( Y0 @ sK15 )
& ( sK5 @ Y0 ) )
@ sK16 ) )
| ~ spl10_5
| spl10_14 ),
inference(sigma_clausification,[],[f157]) ).
thf(f157,plain,
( ( ( ?? @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( Y0 @ sK15 )
& ( sK5 @ Y0 ) ) )
!= $false )
| ~ spl10_5
| spl10_14 ),
inference(beta_eta_normalization,[],[f155]) ).
thf(f155,plain,
( ( ( ^ [Y0: a] : $false
@ sK15 )
!= ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( sK5 @ Y1 ) ) )
@ sK15 ) )
| ~ spl10_5
| spl10_14 ),
inference(negative_extensionality,[],[f143]) ).
thf(f143,plain,
( ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( sK5 @ Y1 ) ) ) )
!= ( ^ [Y0: a] : $false ) )
| ~ spl10_5
| spl10_14 ),
inference(trivial_inequality_removal,[],[f141]) ).
thf(f141,plain,
( ( sK4 != sK4 )
| ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( sK5 @ Y1 ) ) ) )
!= ( ^ [Y0: a] : $false ) )
| ~ spl10_5
| spl10_14 ),
inference(constrained_superposition,[],[f116,f71]) ).
thf(f71,plain,
( ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( sK5 @ Y1 ) ) ) )
= sK4 )
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f69]) ).
thf(f69,plain,
( spl10_5
<=> ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( sK5 @ Y1 ) ) ) )
= sK4 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).
thf(f116,plain,
( ( sK4
!= ( ^ [Y0: a] : $false ) )
| spl10_14 ),
inference(avatar_component_clause,[],[f114]) ).
thf(f114,plain,
( spl10_14
<=> ( sK4
= ( ^ [Y0: a] : $false ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_14])]) ).
thf(f236,plain,
( ~ spl10_5
| spl10_12
| spl10_14
| ~ spl10_20 ),
inference(avatar_contradiction_clause,[],[f235]) ).
thf(f235,plain,
( $false
| ~ spl10_5
| spl10_12
| spl10_14
| ~ spl10_20 ),
inference(trivial_inequality_removal,[],[f231]) ).
thf(f231,plain,
( ( $true = $false )
| ~ spl10_5
| spl10_12
| spl10_14
| ~ spl10_20 ),
inference(superposition,[],[f226,f189]) ).
thf(f189,plain,
( ! [X1: a] :
( $true
= ( sK16 @ X1 ) )
| ~ spl10_20 ),
inference(beta_eta_normalization,[],[f183]) ).
thf(f183,plain,
( ! [X1: a] :
( ( ^ [Y0: a] : $true
@ X1 )
= ( sK16 @ X1 ) )
| ~ spl10_20 ),
inference(argument_congruence,[],[f172]) ).
thf(f172,plain,
( ( sK16
= ( ^ [Y0: a] : $true ) )
| ~ spl10_20 ),
inference(avatar_component_clause,[],[f170]) ).
thf(f170,plain,
( spl10_20
<=> ( sK16
= ( ^ [Y0: a] : $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_20])]) ).
thf(f226,plain,
( ( ( sK16 @ sK18 )
= $false )
| ~ spl10_5
| spl10_12
| spl10_14 ),
inference(trivial_inequality_removal,[],[f220]) ).
thf(f220,plain,
( ( $true = $false )
| ( ( sK16 @ sK18 )
= $false )
| ~ spl10_5
| spl10_12
| spl10_14 ),
inference(superposition,[],[f218,f160]) ).
thf(f160,plain,
( ( $true
= ( sK5 @ sK16 ) )
| ~ spl10_5
| spl10_14 ),
inference(binary_proxy_clausification,[],[f159]) ).
thf(f218,plain,
( ! [X1: a > $o] :
( ( ( sK5 @ X1 )
= $false )
| ( ( X1 @ sK18 )
= $false ) )
| ~ spl10_5
| spl10_12 ),
inference(binary_proxy_clausification,[],[f217]) ).
thf(f217,plain,
( ! [X1: a > $o] :
( ( ( X1 @ sK18 )
& ( sK5 @ X1 ) )
= $false )
| ~ spl10_5
| spl10_12 ),
inference(beta_eta_normalization,[],[f216]) ).
thf(f216,plain,
( ! [X1: a > $o] :
( ( ^ [Y0: a > $o] :
( ( Y0 @ sK18 )
& ( sK5 @ Y0 ) )
@ X1 )
= $false )
| ~ spl10_5
| spl10_12 ),
inference(pi_clausification,[],[f215]) ).
thf(f215,plain,
( ( $true
!= ( ?? @ ( a > $o )
@ ^ [Y0: a > $o] :
( ( Y0 @ sK18 )
& ( sK5 @ Y0 ) ) ) )
| ~ spl10_5
| spl10_12 ),
inference(beta_eta_normalization,[],[f212]) ).
thf(f212,plain,
( ( ( ^ [Y0: a] : $true
@ sK18 )
!= ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( sK5 @ Y1 ) ) )
@ sK18 ) )
| ~ spl10_5
| spl10_12 ),
inference(negative_extensionality,[],[f144]) ).
thf(f144,plain,
( ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( sK5 @ Y1 ) ) ) )
!= ( ^ [Y0: a] : $true ) )
| ~ spl10_5
| spl10_12 ),
inference(trivial_inequality_removal,[],[f142]) ).
thf(f142,plain,
( ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( sK5 @ Y1 ) ) ) )
!= ( ^ [Y0: a] : $true ) )
| ( sK4 != sK4 )
| ~ spl10_5
| spl10_12 ),
inference(constrained_superposition,[],[f105,f71]) ).
thf(f105,plain,
( ( ( ^ [Y0: a] : $true )
!= sK4 )
| spl10_12 ),
inference(avatar_component_clause,[],[f103]) ).
thf(f103,plain,
( spl10_12
<=> ( ( ^ [Y0: a] : $true )
= sK4 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_12])]) ).
thf(f173,plain,
( spl10_19
| spl10_20
| ~ spl10_5
| spl10_14
| ~ spl10_16 ),
inference(avatar_split_clause,[],[f164,f124,f114,f69,f170,f166]) ).
thf(f124,plain,
( spl10_16
<=> ! [X2: a > $o] :
( ( ( ^ [Y0: a] : $false )
= X2 )
| ( ( ^ [Y0: a] : $true )
= X2 )
| ( ( sK5 @ X2 )
!= $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_16])]) ).
thf(f164,plain,
( ( sK16
= ( ^ [Y0: a] : $false ) )
| ( sK16
= ( ^ [Y0: a] : $true ) )
| ~ spl10_5
| spl10_14
| ~ spl10_16 ),
inference(trivial_inequality_removal,[],[f163]) ).
thf(f163,plain,
( ( sK16
= ( ^ [Y0: a] : $false ) )
| ( $true != $true )
| ( sK16
= ( ^ [Y0: a] : $true ) )
| ~ spl10_5
| spl10_14
| ~ spl10_16 ),
inference(superposition,[],[f125,f160]) ).
thf(f125,plain,
( ! [X2: a > $o] :
( ( ( sK5 @ X2 )
!= $true )
| ( ( ^ [Y0: a] : $false )
= X2 )
| ( ( ^ [Y0: a] : $true )
= X2 ) )
| ~ spl10_16 ),
inference(avatar_component_clause,[],[f124]) ).
thf(f135,plain,
( spl10_17
| spl10_18
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f42,f55,f132,f128]) ).
thf(f55,plain,
( spl10_2
<=> ( $true = sP0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
thf(f42,plain,
( ( $true != sP0 )
| ( sK6
= ( ^ [Y0: a] : $true ) )
| ( sK6
= ( ^ [Y0: a] : $false ) ) ),
inference(boolean_simplification,[],[f35]) ).
thf(f35,plain,
( ( $true != sP0 )
| ( sK6
= ( ^ [Y0: a] : ~ $false ) )
| ( sK6
= ( ^ [Y0: a] : $false ) ) ),
inference(cnf_transformation,[],[f24]) ).
thf(f24,plain,
( ( ( ( sK7
= ( ^ [Y0: a] : $false ) )
| ( sK7
= ( ^ [Y0: a] : ~ $false ) ) )
& ( ( ^ [Y0: a] :
( ( sK6 @ Y0 )
& ( sK7 @ Y0 ) ) )
= sK8 )
& ( sK8
!= ( ^ [Y0: a] : ~ $false ) )
& ( ( sK6
= ( ^ [Y0: a] : ~ $false ) )
| ( sK6
= ( ^ [Y0: a] : $false ) ) )
& ( sK8
!= ( ^ [Y0: a] : $false ) ) )
| ( $true != sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f22,f23]) ).
thf(f23,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
= X1 )
| ( ( ^ [Y0: a] : ~ $false )
= X1 ) )
& ( ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X1 @ Y0 ) ) )
= X2 )
& ( ( ^ [Y0: a] : ~ $false )
!= X2 )
& ( ( ( ^ [Y0: a] : ~ $false )
= X0 )
| ( ( ^ [Y0: a] : $false )
= X0 ) )
& ( ( ^ [Y0: a] : $false )
!= X2 ) )
=> ( ( ( sK7
= ( ^ [Y0: a] : $false ) )
| ( sK7
= ( ^ [Y0: a] : ~ $false ) ) )
& ( ( ^ [Y0: a] :
( ( sK6 @ Y0 )
& ( sK7 @ Y0 ) ) )
= sK8 )
& ( sK8
!= ( ^ [Y0: a] : ~ $false ) )
& ( ( sK6
= ( ^ [Y0: a] : ~ $false ) )
| ( sK6
= ( ^ [Y0: a] : $false ) ) )
& ( sK8
!= ( ^ [Y0: a] : $false ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f22,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
= X1 )
| ( ( ^ [Y0: a] : ~ $false )
= X1 ) )
& ( ( ^ [Y0: a] :
( ( X0 @ Y0 )
& ( X1 @ Y0 ) ) )
= X2 )
& ( ( ^ [Y0: a] : ~ $false )
!= X2 )
& ( ( ( ^ [Y0: a] : ~ $false )
= X0 )
| ( ( ^ [Y0: a] : $false )
= X0 ) )
& ( ( ^ [Y0: a] : $false )
!= X2 ) )
| ( $true != sP0 ) ),
inference(rectify,[],[f21]) ).
thf(f21,plain,
( ? [X5: a > $o,X6: a > $o,X7: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
= X6 )
| ( ( ^ [Y0: a] : ~ $false )
= X6 ) )
& ( ( ^ [Y0: a] :
( ( X5 @ Y0 )
& ( X6 @ Y0 ) ) )
= X7 )
& ( ( ^ [Y0: a] : ~ $false )
!= X7 )
& ( ( ( ^ [Y0: a] : ~ $false )
= X5 )
| ( ( ^ [Y0: a] : $false )
= X5 ) )
& ( ( ^ [Y0: a] : $false )
!= X7 ) )
| ( $true != sP0 ) ),
inference(nnf_transformation,[],[f9]) ).
thf(f9,plain,
( ? [X5: a > $o,X6: a > $o,X7: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
= X6 )
| ( ( ^ [Y0: a] : ~ $false )
= X6 ) )
& ( ( ^ [Y0: a] :
( ( X5 @ Y0 )
& ( X6 @ Y0 ) ) )
= X7 )
& ( ( ^ [Y0: a] : ~ $false )
!= X7 )
& ( ( ( ^ [Y0: a] : ~ $false )
= X5 )
| ( ( ^ [Y0: a] : $false )
= X5 ) )
& ( ( ^ [Y0: a] : $false )
!= X7 ) )
| ( $true != sP0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[=])]) ).
thf(f126,plain,
( ~ spl10_6
| spl10_16 ),
inference(avatar_split_clause,[],[f43,f124,f73]) ).
thf(f73,plain,
( spl10_6
<=> ( sP1 = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_6])]) ).
thf(f43,plain,
! [X2: a > $o] :
( ( ( ^ [Y0: a] : $false )
= X2 )
| ( ( sK5 @ X2 )
!= $true )
| ( ( ^ [Y0: a] : $true )
= X2 )
| ( sP1 != $true ) ),
inference(boolean_simplification,[],[f31]) ).
thf(f31,plain,
! [X2: a > $o] :
( ( ( sK5 @ X2 )
!= $true )
| ( ( ^ [Y0: a] : $false )
= X2 )
| ( sP1 != $true )
| ( ( ^ [Y0: a] : ~ $false )
= X2 ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f20,plain,
( ( ( ( ^ [Y0: a] : ~ $false )
!= sK4 )
& ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( sK5 @ Y1 ) ) ) )
= sK4 )
& ! [X2: a > $o] :
( ( ( sK5 @ X2 )
!= $true )
| ( ( ^ [Y0: a] : ~ $false )
= X2 )
| ( ( ^ [Y0: a] : $false )
= X2 ) )
& ( sK4
!= ( ^ [Y0: a] : $false ) ) )
| ( sP1 != $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f18,f19]) ).
thf(f19,plain,
( ? [X0: a > $o,X1: ( a > $o ) > $o] :
( ( ( ^ [Y0: a] : ~ $false )
!= X0 )
& ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( X1 @ Y1 ) ) ) )
= X0 )
& ! [X2: a > $o] :
( ( ( X1 @ X2 )
!= $true )
| ( ( ^ [Y0: a] : ~ $false )
= X2 )
| ( ( ^ [Y0: a] : $false )
= X2 ) )
& ( ( ^ [Y0: a] : $false )
!= X0 ) )
=> ( ( ( ^ [Y0: a] : ~ $false )
!= sK4 )
& ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( sK5 @ Y1 ) ) ) )
= sK4 )
& ! [X2: a > $o] :
( ( ( sK5 @ X2 )
!= $true )
| ( ( ^ [Y0: a] : ~ $false )
= X2 )
| ( ( ^ [Y0: a] : $false )
= X2 ) )
& ( sK4
!= ( ^ [Y0: a] : $false ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f18,plain,
( ? [X0: a > $o,X1: ( a > $o ) > $o] :
( ( ( ^ [Y0: a] : ~ $false )
!= X0 )
& ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( X1 @ Y1 ) ) ) )
= X0 )
& ! [X2: a > $o] :
( ( ( X1 @ X2 )
!= $true )
| ( ( ^ [Y0: a] : ~ $false )
= X2 )
| ( ( ^ [Y0: a] : $false )
= X2 ) )
& ( ( ^ [Y0: a] : $false )
!= X0 ) )
| ( sP1 != $true ) ),
inference(rectify,[],[f17]) ).
thf(f17,plain,
( ? [X2: a > $o,X3: ( a > $o ) > $o] :
( ( ( ^ [Y0: a] : ~ $false )
!= X2 )
& ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( X3 @ Y1 ) ) ) )
= X2 )
& ! [X4: a > $o] :
( ( ( X3 @ X4 )
!= $true )
| ( ( ^ [Y0: a] : ~ $false )
= X4 )
| ( ( ^ [Y0: a] : $false )
= X4 ) )
& ( ( ^ [Y0: a] : $false )
!= X2 ) )
| ( sP1 != $true ) ),
inference(nnf_transformation,[],[f10]) ).
thf(f10,plain,
( ? [X2: a > $o,X3: ( a > $o ) > $o] :
( ( ( ^ [Y0: a] : ~ $false )
!= X2 )
& ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( X3 @ Y1 ) ) ) )
= X2 )
& ! [X4: a > $o] :
( ( ( X3 @ X4 )
!= $true )
| ( ( ^ [Y0: a] : ~ $false )
= X4 )
| ( ( ^ [Y0: a] : $false )
= X4 ) )
& ( ( ^ [Y0: a] : $false )
!= X2 ) )
| ( sP1 != $true ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[=])]) ).
thf(f122,plain,
( ~ spl10_15
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f44,f55,f119]) ).
thf(f44,plain,
( ( ( ^ [Y0: a] : $true )
!= sK8 )
| ( $true != sP0 ) ),
inference(boolean_simplification,[],[f36]) ).
thf(f36,plain,
( ( $true != sP0 )
| ( sK8
!= ( ^ [Y0: a] : ~ $false ) ) ),
inference(cnf_transformation,[],[f24]) ).
thf(f117,plain,
( ~ spl10_14
| ~ spl10_6 ),
inference(avatar_split_clause,[],[f30,f73,f114]) ).
thf(f30,plain,
( ( sP1 != $true )
| ( sK4
!= ( ^ [Y0: a] : $false ) ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f112,plain,
( spl10_2
| spl10_3
| ~ spl10_8
| spl10_6 ),
inference(avatar_split_clause,[],[f40,f73,f83,f60,f55]) ).
thf(f60,plain,
( spl10_3
<=> ( $true = sP2 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
thf(f83,plain,
( spl10_8
<=> ( sK9
= ( ^ [Y0: a] : $false ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_8])]) ).
thf(f40,plain,
( ( sK9
!= ( ^ [Y0: a] : $false ) )
| ( sP1 = $true )
| ( $true = sP2 )
| ( $true = sP0 ) ),
inference(cnf_transformation,[],[f26]) ).
thf(f26,plain,
( ( ( sK9
= ( ^ [Y0: a] : $false ) )
& ( sK9
!= ( ^ [Y0: a] : $false ) )
& ( sK9
!= ( ^ [Y0: a] : ~ $false ) ) )
| ( sP1 = $true )
| ( $true = sP2 )
| ( $true = sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f12,f25]) ).
thf(f25,plain,
( ? [X0: a > $o] :
( ( ( ^ [Y0: a] : $false )
= X0 )
& ( ( ^ [Y0: a] : $false )
!= X0 )
& ( ( ^ [Y0: a] : ~ $false )
!= X0 ) )
=> ( ( sK9
= ( ^ [Y0: a] : $false ) )
& ( sK9
!= ( ^ [Y0: a] : $false ) )
& ( sK9
!= ( ^ [Y0: a] : ~ $false ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
( ? [X0: a > $o] :
( ( ( ^ [Y0: a] : $false )
= X0 )
& ( ( ^ [Y0: a] : $false )
!= X0 )
& ( ( ^ [Y0: a] : ~ $false )
!= X0 ) )
| ( sP1 = $true )
| ( $true = sP2 )
| ( $true = sP0 ) ),
inference(definition_folding,[],[f8,f11,f10,f9]) ).
thf(f11,plain,
( ? [X1: a > $o] :
( ( ( ^ [Y0: a] : ~ $false )
= X1 )
& ( ( ^ [Y0: a] : ~ $false )
!= X1 )
& ( ( ^ [Y0: a] : $false )
!= X1 ) )
| ( $true != sP2 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[=])]) ).
thf(f8,plain,
( ? [X0: a > $o] :
( ( ( ^ [Y0: a] : $false )
= X0 )
& ( ( ^ [Y0: a] : $false )
!= X0 )
& ( ( ^ [Y0: a] : ~ $false )
!= X0 ) )
| ? [X2: a > $o,X3: ( a > $o ) > $o] :
( ( ( ^ [Y0: a] : ~ $false )
!= X2 )
& ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( X3 @ Y1 ) ) ) )
= X2 )
& ! [X4: a > $o] :
( ( ( X3 @ X4 )
!= $true )
| ( ( ^ [Y0: a] : ~ $false )
= X4 )
| ( ( ^ [Y0: a] : $false )
= X4 ) )
& ( ( ^ [Y0: a] : $false )
!= X2 ) )
| ? [X1: a > $o] :
( ( ( ^ [Y0: a] : ~ $false )
= X1 )
& ( ( ^ [Y0: a] : ~ $false )
!= X1 )
& ( ( ^ [Y0: a] : $false )
!= X1 ) )
| ? [X5: a > $o,X6: a > $o,X7: a > $o] :
( ( ( ( ^ [Y0: a] : $false )
= X6 )
| ( ( ^ [Y0: a] : ~ $false )
= X6 ) )
& ( ( ^ [Y0: a] :
( ( X5 @ Y0 )
& ( X6 @ Y0 ) ) )
= X7 )
& ( ( ^ [Y0: a] : ~ $false )
!= X7 )
& ( ( ( ^ [Y0: a] : ~ $false )
= X5 )
| ( ( ^ [Y0: a] : $false )
= X5 ) )
& ( ( ^ [Y0: a] : $false )
!= X7 ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
( ? [X5: a > $o,X6: a > $o,X7: a > $o] :
( ( ( ^ [Y0: a] : $false )
!= X7 )
& ( ( ^ [Y0: a] : ~ $false )
!= X7 )
& ( ( ^ [Y0: a] :
( ( X5 @ Y0 )
& ( X6 @ Y0 ) ) )
= X7 )
& ( ( ( ^ [Y0: a] : ~ $false )
= X5 )
| ( ( ^ [Y0: a] : $false )
= X5 ) )
& ( ( ( ^ [Y0: a] : $false )
= X6 )
| ( ( ^ [Y0: a] : ~ $false )
= X6 ) ) )
| ? [X2: a > $o,X3: ( a > $o ) > $o] :
( ( ( ^ [Y0: a] : $false )
!= X2 )
& ( ( ^ [Y0: a] : ~ $false )
!= X2 )
& ! [X4: a > $o] :
( ( ( ^ [Y0: a] : $false )
= X4 )
| ( ( ^ [Y0: a] : ~ $false )
= X4 )
| ( ( X3 @ X4 )
!= $true ) )
& ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( X3 @ Y1 ) ) ) )
= X2 ) )
| ? [X0: a > $o] :
( ( ( ^ [Y0: a] : $false )
!= X0 )
& ( ( ^ [Y0: a] : ~ $false )
!= X0 )
& ( ( ^ [Y0: a] : $false )
= X0 ) )
| ? [X1: a > $o] :
( ( ( ^ [Y0: a] : $false )
!= X1 )
& ( ( ^ [Y0: a] : ~ $false )
!= X1 )
& ( ( ^ [Y0: a] : ~ $false )
= X1 ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ( ! [X5: a > $o,X6: a > $o,X7: a > $o] :
( ( ( ( ^ [Y0: a] :
( ( X5 @ Y0 )
& ( X6 @ Y0 ) ) )
= X7 )
& ( ( ( ^ [Y0: a] : ~ $false )
= X5 )
| ( ( ^ [Y0: a] : $false )
= X5 ) )
& ( ( ( ^ [Y0: a] : $false )
= X6 )
| ( ( ^ [Y0: a] : ~ $false )
= X6 ) ) )
=> ( ( ( ^ [Y0: a] : $false )
= X7 )
| ( ( ^ [Y0: a] : ~ $false )
= X7 ) ) )
& ! [X2: a > $o,X3: ( a > $o ) > $o] :
( ( ! [X4: a > $o] :
( ( ( X3 @ X4 )
= $true )
=> ( ( ( ^ [Y0: a] : $false )
= X4 )
| ( ( ^ [Y0: a] : ~ $false )
= X4 ) ) )
& ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( X3 @ Y1 ) ) ) )
= X2 ) )
=> ( ( ( ^ [Y0: a] : $false )
= X2 )
| ( ( ^ [Y0: a] : ~ $false )
= X2 ) ) )
& ! [X0: a > $o] :
( ( ( ^ [Y0: a] : $false )
= X0 )
=> ( ( ( ^ [Y0: a] : $false )
= X0 )
| ( ( ^ [Y0: a] : ~ $false )
= X0 ) ) )
& ! [X1: a > $o] :
( ( ( ^ [Y0: a] : ~ $false )
= X1 )
=> ( ( ( ^ [Y0: a] : $false )
= X1 )
| ( ( ^ [Y0: a] : ~ $false )
= X1 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,plain,
~ ( ! [X0: a > $o] :
( ( ( ^ [Y0: a] : $false )
= X0 )
=> ( ( ( ^ [Y0: a] : $false )
= X0 )
| ( ( ^ [Y0: a] : ~ $false )
= X0 ) ) )
& ! [X4: a > $o] :
( ( ( ^ [Y0: a] : ~ $false )
= X4 )
=> ( ( ( ^ [Y0: a] : ~ $false )
= X4 )
| ( ( ^ [Y0: a] : $false )
= X4 ) ) )
& ! [X8: a > $o,X9: ( a > $o ) > $o] :
( ( ! [X10: a > $o] :
( ( $true
= ( X9 @ X10 ) )
=> ( ( ( ^ [Y0: a] : $false )
= X10 )
| ( ( ^ [Y0: a] : ~ $false )
= X10 ) ) )
& ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( X9 @ Y1 ) ) ) )
= X8 ) )
=> ( ( ( ^ [Y0: a] : ~ $false )
= X8 )
| ( ( ^ [Y0: a] : $false )
= X8 ) ) )
& ! [X17: a > $o,X18: a > $o,X19: a > $o] :
( ( ( ( ^ [Y0: a] :
( ( X17 @ Y0 )
& ( X18 @ Y0 ) ) )
= X19 )
& ( ( ( ^ [Y0: a] : $false )
= X17 )
| ( ( ^ [Y0: a] : ~ $false )
= X17 ) )
& ( ( ( ^ [Y0: a] : $false )
= X18 )
| ( ( ^ [Y0: a] : ~ $false )
= X18 ) ) )
=> ( ( ( ^ [Y0: a] : ~ $false )
= X19 )
| ( ( ^ [Y0: a] : $false )
= X19 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ! [X0: a > $o] :
( ( ( ^ [X1: a] : $false )
= X0 )
=> ( ( X0
= ( ^ [X2: a] : ~ $false ) )
| ( X0
= ( ^ [X3: a] : $false ) ) ) )
& ! [X4: a > $o] :
( ( X4
= ( ^ [X5: a] : ~ $false ) )
=> ( ( ( ^ [X6: a] : ~ $false )
= X4 )
| ( ( ^ [X7: a] : $false )
= X4 ) ) )
& ! [X8: a > $o,X9: ( a > $o ) > $o] :
( ( ! [X10: a > $o] :
( ( X9 @ X10 )
=> ( ( X10
= ( ^ [X11: a] : $false ) )
| ( X10
= ( ^ [X12: a] : ~ $false ) ) ) )
& ( X8
= ( ^ [X13: a] :
? [X14: a > $o] :
( ( X9 @ X14 )
& ( X14 @ X13 ) ) ) ) )
=> ( ( X8
= ( ^ [X15: a] : ~ $false ) )
| ( X8
= ( ^ [X16: a] : $false ) ) ) )
& ! [X17: a > $o,X18: a > $o,X19: a > $o] :
( ( ( ( ^ [X20: a] :
( ( X18 @ X20 )
& ( X17 @ X20 ) ) )
= X19 )
& ( ( X17
= ( ^ [X21: a] : $false ) )
| ( ( ^ [X22: a] : ~ $false )
= X17 ) )
& ( ( X18
= ( ^ [X23: a] : $false ) )
| ( X18
= ( ^ [X24: a] : ~ $false ) ) ) )
=> ( ( X19
= ( ^ [X25: a] : ~ $false ) )
| ( ( ^ [X26: a] : $false )
= X19 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [X0: a > $o] :
( ( ( ^ [X1: a] : $false )
= X0 )
=> ( ( X0
= ( ^ [X2: a] : ~ $false ) )
| ( X0
= ( ^ [X2: a] : $false ) ) ) )
& ! [X0: a > $o] :
( ( X0
= ( ^ [X1: a] : ~ $false ) )
=> ( ( ( ^ [X2: a] : ~ $false )
= X0 )
| ( ( ^ [X2: a] : $false )
= X0 ) ) )
& ! [X0: a > $o,X3: ( a > $o ) > $o] :
( ( ! [X1: a > $o] :
( ( X3 @ X1 )
=> ( ( X1
= ( ^ [X2: a] : $false ) )
| ( X1
= ( ^ [X2: a] : ~ $false ) ) ) )
& ( X0
= ( ^ [X1: a] :
? [X4: a > $o] :
( ( X3 @ X4 )
& ( X4 @ X1 ) ) ) ) )
=> ( ( X0
= ( ^ [X2: a] : ~ $false ) )
| ( X0
= ( ^ [X2: a] : $false ) ) ) )
& ! [X5: a > $o,X6: a > $o,X4: a > $o] :
( ( ( ( ^ [X1: a] :
( ( X6 @ X1 )
& ( X5 @ X1 ) ) )
= X4 )
& ( ( X5
= ( ^ [X2: a] : $false ) )
| ( ( ^ [X2: a] : ~ $false )
= X5 ) )
& ( ( X6
= ( ^ [X2: a] : $false ) )
| ( X6
= ( ^ [X2: a] : ~ $false ) ) ) )
=> ( ( X4
= ( ^ [X2: a] : ~ $false ) )
| ( ( ^ [X2: a] : $false )
= X4 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ! [X0: a > $o] :
( ( ( ^ [X1: a] : $false )
= X0 )
=> ( ( X0
= ( ^ [X2: a] : ~ $false ) )
| ( X0
= ( ^ [X2: a] : $false ) ) ) )
& ! [X0: a > $o] :
( ( X0
= ( ^ [X1: a] : ~ $false ) )
=> ( ( ( ^ [X2: a] : ~ $false )
= X0 )
| ( ( ^ [X2: a] : $false )
= X0 ) ) )
& ! [X0: a > $o,X3: ( a > $o ) > $o] :
( ( ! [X1: a > $o] :
( ( X3 @ X1 )
=> ( ( X1
= ( ^ [X2: a] : $false ) )
| ( X1
= ( ^ [X2: a] : ~ $false ) ) ) )
& ( X0
= ( ^ [X1: a] :
? [X4: a > $o] :
( ( X3 @ X4 )
& ( X4 @ X1 ) ) ) ) )
=> ( ( X0
= ( ^ [X2: a] : ~ $false ) )
| ( X0
= ( ^ [X2: a] : $false ) ) ) )
& ! [X5: a > $o,X6: a > $o,X4: a > $o] :
( ( ( ( ^ [X1: a] :
( ( X6 @ X1 )
& ( X5 @ X1 ) ) )
= X4 )
& ( ( X5
= ( ^ [X2: a] : $false ) )
| ( ( ^ [X2: a] : ~ $false )
= X5 ) )
& ( ( X6
= ( ^ [X2: a] : $false ) )
| ( X6
= ( ^ [X2: a] : ~ $false ) ) ) )
=> ( ( X4
= ( ^ [X2: a] : ~ $false ) )
| ( ( ^ [X2: a] : $false )
= X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3gPLeTh5gU/Vampire---4.8_21652',cINDISCRETE_TOPOLOGY_pme) ).
thf(f106,plain,
( ~ spl10_12
| ~ spl10_6 ),
inference(avatar_split_clause,[],[f46,f73,f103]) ).
thf(f46,plain,
( ( sP1 != $true )
| ( ( ^ [Y0: a] : $true )
!= sK4 ) ),
inference(boolean_simplification,[],[f33]) ).
thf(f33,plain,
( ( ( ^ [Y0: a] : ~ $false )
!= sK4 )
| ( sP1 != $true ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f101,plain,
( spl10_7
| ~ spl10_3 ),
inference(avatar_split_clause,[],[f47,f60,f78]) ).
thf(f78,plain,
( spl10_7
<=> ( sK3
= ( ^ [Y0: a] : $true ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_7])]) ).
thf(f47,plain,
( ( sK3
= ( ^ [Y0: a] : $true ) )
| ( $true != sP2 ) ),
inference(boolean_simplification,[],[f29]) ).
thf(f29,plain,
( ( sK3
= ( ^ [Y0: a] : ~ $false ) )
| ( $true != sP2 ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f16,plain,
( ( ( sK3
= ( ^ [Y0: a] : ~ $false ) )
& ( sK3
!= ( ^ [Y0: a] : ~ $false ) )
& ( sK3
!= ( ^ [Y0: a] : $false ) ) )
| ( $true != sP2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f14,f15]) ).
thf(f15,plain,
( ? [X0: a > $o] :
( ( ( ^ [Y0: a] : ~ $false )
= X0 )
& ( ( ^ [Y0: a] : ~ $false )
!= X0 )
& ( ( ^ [Y0: a] : $false )
!= X0 ) )
=> ( ( sK3
= ( ^ [Y0: a] : ~ $false ) )
& ( sK3
!= ( ^ [Y0: a] : ~ $false ) )
& ( sK3
!= ( ^ [Y0: a] : $false ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f14,plain,
( ? [X0: a > $o] :
( ( ( ^ [Y0: a] : ~ $false )
= X0 )
& ( ( ^ [Y0: a] : ~ $false )
!= X0 )
& ( ( ^ [Y0: a] : $false )
!= X0 ) )
| ( $true != sP2 ) ),
inference(rectify,[],[f13]) ).
thf(f13,plain,
( ? [X1: a > $o] :
( ( ( ^ [Y0: a] : ~ $false )
= X1 )
& ( ( ^ [Y0: a] : ~ $false )
!= X1 )
& ( ( ^ [Y0: a] : $false )
!= X1 ) )
| ( $true != sP2 ) ),
inference(nnf_transformation,[],[f11]) ).
thf(f100,plain,
( spl10_10
| spl10_11
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f48,f55,f97,f93]) ).
thf(f48,plain,
( ( sK7
= ( ^ [Y0: a] : $true ) )
| ( sK7
= ( ^ [Y0: a] : $false ) )
| ( $true != sP0 ) ),
inference(boolean_simplification,[],[f38]) ).
thf(f38,plain,
( ( $true != sP0 )
| ( sK7
= ( ^ [Y0: a] : $false ) )
| ( sK7
= ( ^ [Y0: a] : ~ $false ) ) ),
inference(cnf_transformation,[],[f24]) ).
thf(f91,plain,
( spl10_9
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f37,f55,f88]) ).
thf(f37,plain,
( ( $true != sP0 )
| ( ( ^ [Y0: a] :
( ( sK6 @ Y0 )
& ( sK7 @ Y0 ) ) )
= sK8 ) ),
inference(cnf_transformation,[],[f24]) ).
thf(f86,plain,
( spl10_8
| spl10_6
| spl10_3
| spl10_2 ),
inference(avatar_split_clause,[],[f41,f55,f60,f73,f83]) ).
thf(f41,plain,
( ( $true = sP0 )
| ( sP1 = $true )
| ( sK9
= ( ^ [Y0: a] : $false ) )
| ( $true = sP2 ) ),
inference(cnf_transformation,[],[f26]) ).
thf(f81,plain,
( ~ spl10_7
| ~ spl10_3 ),
inference(avatar_split_clause,[],[f49,f60,f78]) ).
thf(f49,plain,
( ( $true != sP2 )
| ( sK3
!= ( ^ [Y0: a] : $true ) ) ),
inference(boolean_simplification,[],[f28]) ).
thf(f28,plain,
( ( $true != sP2 )
| ( sK3
!= ( ^ [Y0: a] : ~ $false ) ) ),
inference(cnf_transformation,[],[f16]) ).
thf(f76,plain,
( spl10_5
| ~ spl10_6 ),
inference(avatar_split_clause,[],[f32,f73,f69]) ).
thf(f32,plain,
( ( sP1 != $true )
| ( ( ^ [Y0: a] :
( ?? @ ( a > $o )
@ ^ [Y1: a > $o] :
( ( Y1 @ Y0 )
& ( sK5 @ Y1 ) ) ) )
= sK4 ) ),
inference(cnf_transformation,[],[f20]) ).
thf(f58,plain,
( ~ spl10_1
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f34,f55,f51]) ).
thf(f34,plain,
( ( $true != sP0 )
| ( sK8
!= ( ^ [Y0: a] : $false ) ) ),
inference(cnf_transformation,[],[f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEV261^5 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 12:12:50 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH0_THM_EQU_NAR problem
% 0.13/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.3gPLeTh5gU/Vampire---4.8_21652
% 0.13/0.36 % (21909)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.13/0.36 % (21909)Instruction limit reached!
% 0.13/0.36 % (21909)------------------------------
% 0.13/0.36 % (21909)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (21909)Termination reason: Unknown
% 0.13/0.36 % (21909)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (21909)Memory used [KB]: 5500
% 0.13/0.36 % (21909)Time elapsed: 0.003 s
% 0.13/0.36 % (21909)Instructions burned: 3 (million)
% 0.13/0.36 % (21909)------------------------------
% 0.13/0.36 % (21909)------------------------------
% 0.13/0.36 % (21905)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.13/0.36 % (21903)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.13/0.36 % (21904)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.13/0.36 % (21906)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.13/0.36 % (21902)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.13/0.36 % (21907)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.13/0.36 % (21908)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.13/0.36 % (21905)Instruction limit reached!
% 0.13/0.36 % (21905)------------------------------
% 0.13/0.36 % (21905)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (21905)Termination reason: Unknown
% 0.13/0.36 % (21905)Termination phase: Preprocessing 1
% 0.13/0.36 % (21906)Instruction limit reached!
% 0.13/0.36 % (21906)------------------------------
% 0.13/0.36 % (21906)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (21906)Termination reason: Unknown
% 0.13/0.36 % (21906)Termination phase: shuffling
% 0.13/0.36
% 0.13/0.36 % (21906)Memory used [KB]: 895
% 0.13/0.36 % (21906)Time elapsed: 0.003 s
% 0.13/0.36 % (21906)Instructions burned: 2 (million)
% 0.13/0.36 % (21906)------------------------------
% 0.13/0.36 % (21906)------------------------------
% 0.13/0.36
% 0.13/0.36 % (21905)Memory used [KB]: 895
% 0.13/0.36 % (21905)Time elapsed: 0.003 s
% 0.13/0.36 % (21905)Instructions burned: 2 (million)
% 0.13/0.36 % (21905)------------------------------
% 0.13/0.36 % (21905)------------------------------
% 0.13/0.37 % (21903)Instruction limit reached!
% 0.13/0.37 % (21903)------------------------------
% 0.13/0.37 % (21903)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (21903)Termination reason: Unknown
% 0.13/0.37 % (21903)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (21903)Memory used [KB]: 5500
% 0.13/0.37 % (21903)Time elapsed: 0.005 s
% 0.13/0.37 % (21903)Instructions burned: 4 (million)
% 0.13/0.37 % (21903)------------------------------
% 0.13/0.37 % (21903)------------------------------
% 0.13/0.37 % (21907)Refutation not found, incomplete strategy
% 0.13/0.37 % (21907)------------------------------
% 0.13/0.37 % (21907)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (21907)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 % (21907)Memory used [KB]: 5500
% 0.13/0.37 % (21907)Time elapsed: 0.005 s
% 0.13/0.37 % (21907)Instructions burned: 4 (million)
% 0.13/0.37 % (21907)------------------------------
% 0.13/0.37 % (21907)------------------------------
% 0.13/0.37 % (21917)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on Vampire---4 for (2999ds/37Mi)
% 0.13/0.38 % (21908)Instruction limit reached!
% 0.13/0.38 % (21908)------------------------------
% 0.13/0.38 % (21908)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (21908)Termination reason: Unknown
% 0.13/0.38 % (21908)Termination phase: Saturation
% 0.13/0.38
% 0.13/0.38 % (21908)Memory used [KB]: 5628
% 0.13/0.38 % (21908)Time elapsed: 0.016 s
% 0.13/0.38 % (21908)Instructions burned: 19 (million)
% 0.13/0.38 % (21908)------------------------------
% 0.13/0.38 % (21908)------------------------------
% 0.13/0.38 % (21922)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.13/0.38 % (21922)Instruction limit reached!
% 0.13/0.38 % (21922)------------------------------
% 0.13/0.38 % (21922)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (21922)Termination reason: Unknown
% 0.13/0.38 % (21922)Termination phase: Saturation
% 0.13/0.38
% 0.13/0.38 % (21922)Memory used [KB]: 5500
% 0.13/0.38 % (21922)Time elapsed: 0.004 s
% 0.13/0.38 % (21922)Instructions burned: 3 (million)
% 0.13/0.38 % (21917)Instruction limit reached!
% 0.13/0.38 % (21917)------------------------------
% 0.13/0.38 % (21917)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (21917)Termination reason: Unknown
% 0.13/0.38 % (21917)Termination phase: Saturation
% 0.13/0.38
% 0.13/0.38 % (21917)Memory used [KB]: 5628
% 0.13/0.38 % (21917)Time elapsed: 0.014 s
% 0.13/0.38 % (21917)Instructions burned: 38 (million)
% 0.13/0.38 % (21917)------------------------------
% 0.13/0.38 % (21917)------------------------------
% 0.13/0.38 % (21922)------------------------------
% 0.13/0.38 % (21922)------------------------------
% 0.13/0.38 % (21926)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on Vampire---4 for (2999ds/7Mi)
% 0.13/0.38 % (21925)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on Vampire---4 for (2999ds/1041Mi)
% 0.13/0.38 % (21904)Instruction limit reached!
% 0.13/0.38 % (21904)------------------------------
% 0.13/0.38 % (21904)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (21904)Termination reason: Unknown
% 0.13/0.38 % (21904)Termination phase: Saturation
% 0.13/0.38
% 0.13/0.38 % (21904)Memory used [KB]: 5756
% 0.13/0.38 % (21904)Time elapsed: 0.022 s
% 0.13/0.38 % (21904)Instructions burned: 27 (million)
% 0.13/0.38 % (21904)------------------------------
% 0.13/0.38 % (21904)------------------------------
% 0.13/0.39 % (21926)Instruction limit reached!
% 0.13/0.39 % (21926)------------------------------
% 0.13/0.39 % (21926)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.39 % (21926)Termination reason: Unknown
% 0.13/0.39 % (21926)Termination phase: Saturation
% 0.13/0.39
% 0.13/0.39 % (21926)Memory used [KB]: 1023
% 0.13/0.39 % (21926)Time elapsed: 0.007 s
% 0.13/0.39 % (21926)Instructions burned: 7 (million)
% 0.13/0.39 % (21926)------------------------------
% 0.13/0.39 % (21926)------------------------------
% 0.13/0.39 % (21921)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on Vampire---4 for (2999ds/15Mi)
% 0.13/0.39 % (21931)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.13/0.39 % (21931)Instruction limit reached!
% 0.13/0.39 % (21931)------------------------------
% 0.13/0.39 % (21931)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.39 % (21931)Termination reason: Unknown
% 0.13/0.39 % (21931)Termination phase: Saturation
% 0.13/0.39
% 0.13/0.39 % (21931)Memory used [KB]: 5500
% 0.13/0.39 % (21931)Time elapsed: 0.003 s
% 0.13/0.39 % (21931)Instructions burned: 5 (million)
% 0.13/0.39 % (21931)------------------------------
% 0.13/0.39 % (21931)------------------------------
% 0.13/0.39 % (21930)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on Vampire---4 for (2999ds/16Mi)
% 0.13/0.40 % (21932)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.13/0.40 % (21932)Instruction limit reached!
% 0.13/0.40 % (21932)------------------------------
% 0.13/0.40 % (21932)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (21932)Termination reason: Unknown
% 0.13/0.40 % (21932)Termination phase: Saturation
% 0.13/0.40
% 0.13/0.40 % (21932)Memory used [KB]: 1023
% 0.13/0.40 % (21932)Time elapsed: 0.004 s
% 0.13/0.40 % (21932)Instructions burned: 4 (million)
% 0.13/0.40 % (21932)------------------------------
% 0.13/0.40 % (21932)------------------------------
% 0.13/0.40 % (21933)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on Vampire---4 for (2999ds/7Mi)
% 0.13/0.40 % (21921)Instruction limit reached!
% 0.13/0.40 % (21921)------------------------------
% 0.13/0.40 % (21921)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (21921)Termination reason: Unknown
% 0.13/0.40 % (21921)Termination phase: Saturation
% 0.13/0.40
% 0.13/0.40 % (21921)Memory used [KB]: 5756
% 0.13/0.40 % (21921)Time elapsed: 0.035 s
% 0.13/0.40 % (21921)Instructions burned: 15 (million)
% 0.13/0.40 % (21921)------------------------------
% 0.13/0.40 % (21921)------------------------------
% 0.13/0.40 % (21939)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.13/0.40 % (21936)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.13/0.40 % (21939)Instruction limit reached!
% 0.13/0.40 % (21939)------------------------------
% 0.13/0.40 % (21939)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (21939)Termination reason: Unknown
% 0.13/0.40 % (21939)Termination phase: Saturation
% 0.13/0.40
% 0.13/0.40 % (21939)Memory used [KB]: 5500
% 0.13/0.40 % (21939)Time elapsed: 0.003 s
% 0.13/0.40 % (21939)Instructions burned: 4 (million)
% 0.13/0.40 % (21939)------------------------------
% 0.13/0.40 % (21939)------------------------------
% 0.13/0.40 % (21933)Refutation not found, incomplete strategy
% 0.13/0.40 % (21933)------------------------------
% 0.13/0.40 % (21933)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (21933)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 % (21933)Memory used [KB]: 5500
% 0.13/0.40 % (21933)Time elapsed: 0.006 s
% 0.13/0.40 % (21933)Instructions burned: 6 (million)
% 0.13/0.40 % (21933)------------------------------
% 0.13/0.40 % (21933)------------------------------
% 0.13/0.40 % (21936)Instruction limit reached!
% 0.13/0.40 % (21936)------------------------------
% 0.13/0.40 % (21936)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (21936)Termination reason: Unknown
% 0.13/0.40 % (21936)Termination phase: Saturation
% 0.13/0.40
% 0.13/0.40 % (21936)Memory used [KB]: 5500
% 0.13/0.40 % (21936)Time elapsed: 0.004 s
% 0.13/0.40 % (21936)Instructions burned: 4 (million)
% 0.13/0.40 % (21936)------------------------------
% 0.13/0.40 % (21936)------------------------------
% 0.13/0.40 % (21930)Instruction limit reached!
% 0.13/0.40 % (21930)------------------------------
% 0.13/0.40 % (21930)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.40 % (21930)Termination reason: Unknown
% 0.13/0.40 % (21930)Termination phase: Saturation
% 0.13/0.40
% 0.13/0.40 % (21930)Memory used [KB]: 5756
% 0.13/0.40 % (21930)Time elapsed: 0.014 s
% 0.13/0.40 % (21930)Instructions burned: 17 (million)
% 0.13/0.40 % (21930)------------------------------
% 0.13/0.40 % (21930)------------------------------
% 0.21/0.41 % (21945)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on Vampire---4 for (2999ds/6Mi)
% 0.21/0.41 % (21942)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.21/0.41 % (21945)Instruction limit reached!
% 0.21/0.41 % (21945)------------------------------
% 0.21/0.41 % (21945)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.41 % (21945)Termination reason: Unknown
% 0.21/0.41 % (21945)Termination phase: Saturation
% 0.21/0.41
% 0.21/0.41 % (21945)Memory used [KB]: 5628
% 0.21/0.41 % (21945)Time elapsed: 0.004 s
% 0.21/0.41 % (21945)Instructions burned: 7 (million)
% 0.21/0.41 % (21945)------------------------------
% 0.21/0.41 % (21945)------------------------------
% 0.21/0.41 % (21943)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on Vampire---4 for (2999ds/710Mi)
% 0.21/0.42 % (21946)dis+1002_5:1_au=on:bd=off:e2e=on:fde=none:fs=off:fsr=off:sos=on:i=902:si=on:rtra=on_0 on Vampire---4 for (2999ds/902Mi)
% 0.21/0.42 % (21947)dis+21_1:8_apa=on:cnfonf=off:fd=off:fsr=off:hud=0:ins=1:kws=inv_frequency:nwc=10.0:ss=axioms:st=5.0:i=21:si=on:rtra=on_0 on Vampire---4 for (2999ds/21Mi)
% 0.21/0.42 % (21948)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on Vampire---4 for (2999ds/5Mi)
% 0.21/0.42 % (21946)Refutation not found, incomplete strategy
% 0.21/0.42 % (21946)------------------------------
% 0.21/0.42 % (21946)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (21946)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42 % (21946)Memory used [KB]: 5500
% 0.21/0.42 % (21946)Time elapsed: 0.004 s
% 0.21/0.42 % (21946)Instructions burned: 3 (million)
% 0.21/0.42 % (21946)------------------------------
% 0.21/0.42 % (21946)------------------------------
% 0.21/0.42 % (21948)Instruction limit reached!
% 0.21/0.42 % (21948)------------------------------
% 0.21/0.42 % (21948)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (21948)Termination reason: Unknown
% 0.21/0.42 % (21948)Termination phase: Saturation
% 0.21/0.42
% 0.21/0.42 % (21948)Memory used [KB]: 5500
% 0.21/0.42 % (21948)Time elapsed: 0.005 s
% 0.21/0.42 % (21948)Instructions burned: 5 (million)
% 0.21/0.42 % (21948)------------------------------
% 0.21/0.42 % (21948)------------------------------
% 0.21/0.42 % (21952)lrs+2_1:1_cnfonf=lazy_not_gen_be_off:cs=on:fe=off:hud=10:inj=on:ins=3:plsq=on:plsqc=1:sd=10:ss=axioms:tnu=1:i=6:si=on:rtra=on_0 on Vampire---4 for (2999ds/6Mi)
% 0.21/0.42 % (21952)Instruction limit reached!
% 0.21/0.42 % (21952)------------------------------
% 0.21/0.42 % (21952)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.42 % (21952)Termination reason: Unknown
% 0.21/0.42 % (21952)Termination phase: Saturation
% 0.21/0.42
% 0.21/0.42 % (21952)Memory used [KB]: 5500
% 0.21/0.42 % (21952)Time elapsed: 0.003 s
% 0.21/0.42 % (21952)Instructions burned: 6 (million)
% 0.21/0.42 % (21952)------------------------------
% 0.21/0.42 % (21952)------------------------------
% 0.21/0.43 % (21942)Instruction limit reached!
% 0.21/0.43 % (21942)------------------------------
% 0.21/0.43 % (21942)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.43 % (21942)Termination reason: Unknown
% 0.21/0.43 % (21942)Termination phase: Saturation
% 0.21/0.43
% 0.21/0.43 % (21942)Memory used [KB]: 5628
% 0.21/0.43 % (21942)Time elapsed: 0.015 s
% 0.21/0.43 % (21942)Instructions burned: 19 (million)
% 0.21/0.43 % (21942)------------------------------
% 0.21/0.43 % (21942)------------------------------
% 0.21/0.43 % (21902)First to succeed.
% 0.21/0.43 % (21902)Refutation found. Thanks to Tanya!
% 0.21/0.43 % SZS status Theorem for Vampire---4
% 0.21/0.43 % SZS output start Proof for Vampire---4
% See solution above
% 0.21/0.43 % (21902)------------------------------
% 0.21/0.43 % (21902)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.43 % (21902)Termination reason: Refutation
% 0.21/0.43
% 0.21/0.43 % (21902)Memory used [KB]: 6652
% 0.21/0.43 % (21902)Time elapsed: 0.067 s
% 0.21/0.43 % (21902)Instructions burned: 91 (million)
% 0.21/0.43 % (21902)------------------------------
% 0.21/0.43 % (21902)------------------------------
% 0.21/0.43 % (21900)Success in time 0.084 s
% 0.21/0.43 % Vampire---4.8 exiting
%------------------------------------------------------------------------------